New Convex Relaxations for Quadratic Assignment Problems
نویسندگان
چکیده
Quadratic assignment problems (QAPs) are known to be among the hardest discrete optimization problems. Recent study shows that even obtaining a strong lower bound for QAPs is a computational challenge. In this paper, we first discuss how to construct new simple convex relaxations of QAPs based on various matrix splitting schemes. Then we introduce the so-called symmetric mappings that can be used to derive strong cuts for the proposed relaxation model. We show that the bounds based on the new models are comparable to the strongest bounds in the literature. Promising experimental results based on the new relaxations will be reported.
منابع مشابه
A new relaxation framework for quadratic assignment problems based on matrix splitting
Quadratic assignment problems (QAPs) are known to be among the hardest discrete optimization problems. Recent study shows that even obtaining a strong lower bound for QAPs is a computational challenge. In this paper, we first discuss how to construct new simple convex relaxations of QAPs based on various matrix splitting schemes. Then we introduce the so-called symmetric mappings that can be us...
متن کاملEfficient Lifted Relaxations of the Quadratic Assignment Problem
Quadratic assignment problems (QAPs) and quadratic assignment matchings (QAMs) recently gained a lot of interest in computer graphics and vision, e.g. for shape and graph matching. Literature describes several convex relaxations to approximate solutions of the NP-hard QAPs in polynomial time. We compare the convex relaxations recently introduced in computer graphics and vision to established ap...
متن کاملSolving Quadratic Assignment Problems Using Convex Quadratic Programming Relaxations
We describe a branch and bound algorithm for the quadratic assignment problem QAP that uses a convex quadratic programming QP relaxation to obtain a bound at each node The QP subproblems are approximately solved using the Frank Wolfe algorithm which in this case requires the solution of a linear assignment problem on each iteration Our branching strategy makes extensive use of dual information ...
متن کامل1 Parallel Semidefinite Programming and Combinatorial Optimization STEVEN
The use of semidefinite programming in combinatorial optimization continues to grow. This growth can be attributed to at least three factors: new semidefinite relaxations that provide tractable bounds to hard combinatorial problems, algorithmic advances in the solution of semidefinite programs (SDP), and the emergence of parallel computing. Solution techniques for minimizing combinatorial probl...
متن کاملA Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کامل